public class Practice4 {
    //https://www.nowcoder.com/practice/2237b401eb9347d282310fc1c3adb134?tpId=265&tqId=39288&ru=/exam/oj
    //动态规划简单题
    public int maxValue (int[][] grid) {
        // write code here
        int n = grid.length;
        int m = grid[0].length;
        int[][] dp = new int[n + 1][m + 1];
        for(int i = 1;i <= n;i++){
            for(int j = 1;j <= m;j++){
                dp[i][j] = Math.max(dp[i - 1][j],dp[i][j - 1]) + grid[i - 1][j - 1];
            }
        }

        return dp[n][m];
    }
    public static void main(String[] args) {

    }
}
